package LeetCode.LeetCode2;

public class Num03 {
    public int findRepeatNumber(int[] nums) {
        for (int i = 0; i < nums.length - 1; i++) {
            for (int j = i; j < nums.length - 1; j++) {
                if(nums[i] == nums[j]){
                    return nums[i];
                }
            }
        }
        return 0;
    }
}
